The Green polynomials via vertex operators

An iterative formula for the Green polynomial is given using the vertex operator realization of the Hall-Littlewood function. Based on this, (1) a general combinatorial formula of the Green polynomial is given; (2) several compact formulas are given for Green's polynomials associated with upper partitions of length ≤3 and the diagonal lengths ≤3; (3) a Murnaghan-Nakayama type formula for the Green polynomial is obtained; and (4) an iterative formula is derived for the bitrace of the finite general linear group G and the Iwahori-Hecke algebra of type A on the permutation module of G by its Borel subgroup.     

Some methods of training radial basis neural networks in solving the Navier‐Stokes equations

The purpose of this research is to analyze the application of neural networks and specific features of training radial basis functions for solving 2‐dimensional Navier‐Stokes equations. The authors developed an algorithm for solving hydrodynamic equations with representation of their solution by the method of weighted residuals upon the general neural network approximation throughout the entire computational domain. The article deals with testing of the developed algorithm through solving the 2‐dimensional Navier‐Stokes equations. Artificial neural networks are widely used for solving problems of mathematical physics; however, their use for modeling of hydrodynamic problems is very limited. At the same time, the problem of hydrodynamic modeling can be solved through neural network modeling, and our study demonstrates an example of its solution. The choice of neural networks based on radial basis functions is due to the ease of implementation and organization of the training process, the accuracy of the approximations, and smoothness of solutions. Radial basis neural networks in the solution of differential equations in partial derivatives allow obtaining a sufficiently accurate solution with a relatively small size of the neural network model. The authors propose to consider the neural network as an approximation of the unknown solution of the equation. The Gaussian distribution is used as the activation function.     

The spectral analysis and exponential stability of a bi‐directional coupled wave‐ODE system

In this paper, an unstable linear time invariant (LTI) ODE system is stabilized exponentially by the PDE compensato—a wave equation with Kelvin‐Voigt (K‐V) damping. Direct feedback connections between the ODE system and wave equation are established: The velocity of the wave equation enters the ODE through the variable v_t(1,t); meanwhile, the output of the ODE is fluxed into the wave equation. It is found that the spectrum of the system operator is composed of two parts: point spectrum and continuous spectrum. The continuous spectrum consists of an isolated point , and there are two branches of asymptotic eigenvalues: the first branch approaches to , and the other branch tends to ?∞. It is shown that there is a sequence of generalized eigenfunctions, which forms a Riesz basis for the Hilbert state space. As a consequence, the spectrum‐determined growth condition and exponential stability of the system are concluded.     

On a sufficient condition for a Fano manifold to be covered by rational N-folds

In this paper, we prove a conjecture by T. Suzuki, which says if a smooth Fano manifold satisfies some positivity condition on its Chern characters, then it can be covered by rational N-folds. We prove this conjecture by using purely combinatorial properties of Bernoulli numbers.     

Extension of Laguerre polynomials with negative arguments

We consider the irreducibility of polynomial $L_n^{\left(\alpha \right)}\left(x\right)$ where $\alpha$ is a negative integer. We observe that the constant term of $L_n^{\left(\alpha \right)}\left(x\right)$ vanishes if and only if $n\ge \left|\alpha \right|=?\alpha$. Therefore we assume that $\alpha =?n?s?1$ where $s$ is a non-negative integer. Let $g\left(x\right)={(?1)}^n{L}_n^{(?n?s?1)}\left(x\right)=\sum _{j=0}^n{a}_j\frac{x^j}{j!}$ and more general polynomial, let $G\left(x\right)=\sum _{j=0}^n{a}_j{b}_j\frac{x^j}{j!}$ where $b_j$ with $0\le j\le n$ are integers such that $\left|b_0\right|=\left|b_n\right|=1$. Schur was the first to prove the irreducibility of $g\left(x\right)$ for $s=0$. It has been proved that $g\left(x\right)$ is irreducible for $0\le s\le 60$. In this paper, by a different method, we prove: Apart from finitely many explicitly given possibilities, either $G\left(x\right)$ is irreducible or $G\left(x\right)$ is linear factor times irreducible polynomial. This is a consequence of the estimate $s>1.9k$ whenever $G\left(x\right)$ has a factor of degree $k\ge 2$ and $(n,k,s)\ne (10,5,4)$. This sharpens earlier estimates of Shorey and Tijdeman and Nair and Shorey.     

Multifold factorizations of cyclic groups into subsets

Let $(G,+)$ be an abelian group. A finite multiset A over G is said to give a λ-fold factorization of G if there exists a multiset B over G such that each element of G occurs λ times in the multiset $A+B:=\{a+b:a\in A,b\in B\}$. In this article, restricting G to a cyclic group, we will provide sufficient conditions on a given multiset A under which the exact value or an upper bound of the minimum multiplicity λ of a factorization of G can be given by introducing a concept of ‘lcm-closure’. Furthermore, a couple of properties on a given factor A will be shown when A has a prime or prime power order (cardinality). A relation to multifold factorizations of the set of integers will be also glanced at a general perspective.